Fragmented Retrenchment, Concurrency and Fairness
نویسندگان
چکیده
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and briefly justified. Fragmented retrenchment permits the granularity of actions to decrease across a development step, many concrete steps retrenching a single abstract one. This generates the usual proliferation of inter-leavings of events at the concrete level. Event structures, particularly flow event structures, help to control these within the retrenchments of a single abstract step, while the concurrent reading of the fragmented retrenchment proof obligation permits acceptable interleavings of retrenchments of different steps. It is observed that retrenchment allows the convenient description of unfair behaviours when fairness is not guaranteed.
منابع مشابه
Concurrency, Fairness and Logical Complexity
We consider a connection between fairness and 0 3 sets of functions made recently by Darondeau, Nolte, Priese and Yoccoz, and extend their work to cater for eeective asynchronous transition systems with concurrency structure represented by a Mazurkiewicz independency relation.
متن کاملFrom Fairness to Chance
Fairness is a mathematical abstraction used in the modeling of a wide range of phenomena, including concurrency, scheduling, and probability. In this paper, we study fairness in the context of probabilistic systems, and we introduce probabilistic fairness, a novel notion of fairness that is itself deened in terms of probability. The deenition of probabilistic fairness makes it invariant with re...
متن کاملPreliminary Proceedings 13 th International Workshop on Expressiveness in Concurrency EXPRESS ’ 06 Bonn , Germany 26 August 2006 Editors : Roberto Amadio
We give an overview over recent work on fairness in reactive and concurrent systems, including an abstract characterisation of fairness. We also derive a notion of a fairly correct system and sketch its application.
متن کاملFairness for Chorded Languages
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair treatment of processes by the scheduler. We define weak and strong fairness for the Small Chorded Object-Oriented Language (SCHOOL) which allows the classification of executions as fair. We investigate the liveness beha...
متن کاملApproaching a Formal Definition of Fairness in Electronic Commerce
The notion of fairness is a very general concept and can be used to coin terms in many different application areas. Recently, the term fairness has appeared in the context of electronic commerce. Here, the term fair exchange refers to the problem that two parties want to swap some distinct items in a way which ensures that no participant can gain advantage over the other. Many protocols for fai...
متن کامل